On Antimagic Labeling of Odd Regular Graphs
نویسندگان
چکیده
An antimagic labeling of a finite simple undirected graph with q edges is a bijection from the set of edges to the set of integers {1, 2, · · · , q} such that the vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of labels of all edges incident to such vertex. A graph is called antimagic if it admits an antimagic labeling. It was conjectured by N. Hartsfield and G. Ringel in 1990 that all connected graphs besides K2 are antimagic. Another weaker version of the conjecture is every regular graph is antimagic except K2. Both conjectures remain unsettled so far. In this article, certain classes of regular graphs of odd degree with particular type of perfect matchings are shown to be antimagic. As a byproduct, all generalized Petersen graphs and some subclass of Cayley graphs of Zn are antimagic.
منابع مشابه
Constructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملRegular Graphs of Odd Degree Are Antimagic
An antimagic labeling of a graph G with m edges is a bijection from E(G) to {1, 2, . . . ,m} such that for all vertices u and v, the sum of labels on edges incident to u differs from that for edges incident to v. Hartsfield and Ringel conjectured that every connected graph other than the single edge K2 has an antimagic labeling. We prove this conjecture for regular graphs of odd degree.
متن کاملProducts of Regular Graphs are Antimagic
An antimagic labeling of a finite undirected simple graph with m edges and n vertices is a bijection from the set of edges to the integers 1, . . . ,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with the same vertex. A graph is called antimagic if it has an antimagic labeling. In 1990, Hartsfield and Ringel [5] conjectured tha...
متن کاملRegular handicap tournaments of high degree
A handicap distance antimagic labeling of a graph G = (V,E) with n vertices is a bijection f : V → {1, 2, . . . , n} with the property that f(xi) = i and the sequence of the weights w(x1), w(x2), . . . , w(xn) (where w(xi) = ∑ xj∈N(xi) f(xj)) forms an increasing arithmetic progression with difference one. A graph G is a handicap distance antimagic graph if it allows a handicap distance antimagi...
متن کاملCartesian Products of Regular Graphs are Antimagic
An antimagic labeling of a finite undirected simple graph with m edges and n vertices is a bijection from the set of edges to the integers 1, . . . ,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with the same vertex. A graph is called antimagic if it has an antimagic labeling. In 1990, Hartsfield and Ringel [4] conjectured tha...
متن کامل